On-line Maximum Independent Set in Chordal Graphs
نویسندگان
چکیده
In this paper we deal with the on-line maximum independent set and we propose a probabilistic O(logn)-competitive algorithm for chordal and interval graphs, proving that the same ratio is a lower bound of the problem. The relation of the on-line maximum independent set with the on-line admission control, allows us to obtain as particular case, an O(logn)-competitive algorithm for the on-line admission control in trees and lines. In addition to that, we propose a competitive algorithm for the on-line call admission of subtrees in trees.
منابع مشابه
Treewidth for Graphs with Small Chordality
A graph G is k-chordal, if it does not contain chordless cycles of length larger than k. The chordality Ic of a graph G is the minimum k for which G is k-chordal. The degeneracy or the width of a graph is the maximum min-degree of any of its subgraphs. Our results are the following: ( 1) The problem of treewidth remains NP-complete when restricted to graphs with small maximum degree. (2) An upp...
متن کاملCounting the number of independent sets in chordal graphs
We study some counting and enumeration problems for chordal graphs, especially concerning independent sets. We first provide the following efficient algorithms for a chordal graph: (1) a linear-time algorithm for counting the number of independent sets; (2) a linear-time algorithm for counting the number of maximum independent sets; (3) a polynomial-time algorithm for counting the number of ind...
متن کاملStrongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs
In this paper those graphs are studied for which a so-called strong ordering of the vertex set exists. This class of graphs, called strongly orderable graphs, generalizes the strongly chordal graphs and the chordal bipartite graphs in a quite natural way. We consider two characteristic elimination orderings for strongly orderable graphs, one on the vertex set and the second on the edge set, and...
متن کاملLinear-Time Counting Algorithms for Independent Sets in Chordal Graphs
We study some counting and enumeration problems for chordal graphs, especially concerning independent sets. We first provide the following efficient algorithms for a chordal graph: (1) a linear-time algorithm for counting the number of independent sets; (2) a linear-time algorithm for counting the number of maximum independent sets; (3) a polynomial-time algorithm for counting the number of ind...
متن کاملOn Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators
Fomin and Villanger ([14], STACS 2010) proved that Maximum Independent Set, Feedback Vertex Set, and more generally the problem of finding a maximum induced subgraph of treewith at most a constant t, can be solved in polynomial time on graph classes with polynomially many minimal separators. We extend these results in two directions. Let Gpoly be the class of graphs with at most poly(n) minimal...
متن کامل